Fast enclosure for a matrix inverse square root

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the accuracy of the fast inverse square root algorithm

We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or similar computational cost. The main idea of our work consists in modifying the NewtonRaphson method and demanding that the maximal error is as small as possible. ...

متن کامل

Fast Enclosure of Matrix Polynomials

A method for enclosing matrix polynomials is proposed. This method is applicable when the matrix is diagonalizable and supplies an interval matrix including the matrix polynomial. The computational cost of this method does not depend on the degree of the polynomial. Hence the proposed method is faster than previous approaches when the degree is large. Numerical results show the properties of th...

متن کامل

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

Fast Floating Point Square Root

Hain and Freire have proposed different floating point square root algorithms that can be efficiently implemented in hardware. The algorithms are compared and evaluated on both performance and precision.

متن کامل

Newton's Method for the Matrix Square Root*

One approach to computing a square root of a matrix A is to apply Newton's method to the quadratic matrix equation F( X) = X2 A =0. Two widely-quoted matrix square root iterations obtained by rewriting this Newton iteration are shown to have excellent mathematical convergence properties. However, by means of a perturbation analysis and supportive numerical examples, it is shown that these simpl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.11.007